UPC - PDFSEARCH.IO - Document Search Engine

UPC
Results: 2549

#	Item
21	Combination Methods for Model-Checking of Infinite-State Systems S. Ghilardi1 , E. Nicolini2 , S. Ranise2 , and D. Zucchelli1,2 1 Università 2 LORIA Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2007-07-09 05:49:18 Theoretical computer science Temporal logic Computer science Formal methods Linear temporal logic Model checking Amir Pnueli French Institute for Research in Computer Science and Automation Mathematical logic Temporal logic in finite-state verification
22	MiniMaxSat: a New Weighted Max-SAT Solver Federico Heras, Javier Larrosa, and Albert Oliveras Universitat Politecnica de Catalunya, Jordi Girona 1-3, 08034 Barcelona, Spain Abstract. In this paper we introduce M INI M A Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2007-03-01 08:21:24 Theoretical computer science Mathematics Computational complexity theory Logic in computer science Automated theorem proving Boolean algebra NP-complete problems Combinatorial optimization Maximum satisfiability problem Boolean satisfiability problem Resolution Unit propagation
23	Splitting on Demand in SAT Modulo Theories Clark Barrett? , Robert Nieuwenhuis?? , Albert Oliveras??, and Cesare Tinelli? ? ? Abstract. Lazy algorithms for Satisfiability Modulo Theories (SMT) combine a generic DPLL-base Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2006-07-31 08:38:18 Theoretical computer science Mathematical logic Mathematics Constraint programming Automated theorem proving Logic in computer science Formal methods Propositional calculus Satisfiability modulo theories DPLL algorithm Unit propagation Solver
24	Splitting on Demand in SAT Modulo Theories Clark Barrett, Robert Nieuwenhuis, Albert Oliveras, Cesare Tinelli New York Univ. Techn. Univ. Catalonia Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2006-11-16 20:30:50 Theoretical computer science Mathematical logic Mathematics Boolean algebra Logic in computer science Electronic design automation Formal methods NP-complete problems Boolean satisfiability problem Phnom Penh Solver Propositional calculus
25	SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers Germain Faure, Robert Nieuwenhuis, Albert Oliveras and Enric Rodr´ıguez-Carbonell? Abstract. Many highly sophisticated tools exist for Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2008-05-08 10:37:46 Theoretical computer science Mathematics Computational complexity theory Electronic design automation Formal methods Logic in computer science NP-complete problems Boolean algebra Satisfiability modulo theories Boolean satisfiability problem Linear programming AMPL
26	Deciding Unbounded Heaps in an SMT Framework Zvonimir Rakamarić 1 , Roberto Bruttomesso 2 , Alan Hu 1 , Alessandro Cimatti 2 1 University of British Columbia; 2 ITCIRST Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2007-07-09 10:11:38 Theoretical computer science Mathematics Computational complexity theory Constraint programming Electronic design automation Logic in computer science Satisfiability modulo theories Heap FO Transitive closure
27	Abstract DPLL and Abstract DPLL Modulo Theories Robert Nieuwenhuis1 , Albert Oliveras1 , and Cesare Tinelli2 1 Technical University of Catalonia Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2005-03-21 16:24:36 Theoretical computer science Mathematics Computational complexity theory Formal methods Electronic design automation Logic in computer science NP-complete problems Boolean algebra Boolean satisfiability problem DPLL Phase-locked loop Satisfiability
28	E-matching for Fun and Profit Michał Moskal, Jakub Łopuszański, Joseph R. Kiniry Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2007-07-09 08:14:48 Logic Automated theorem proving Logic programming Combinatorial optimization Matching Substitution Mathematics Theoretical computer science
29	On SAT Modulo Theories and Optimization Problems Robert Nieuwenhuis and Albert Oliveras? Abstract. Solvers for SAT Modulo Theories (SMT) can nowadays handle large industrial (e.g., formal hardware and software verificati Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2006-04-28 13:17:24 Theoretical computer science Mathematics Mathematical logic Logic in computer science Automated theorem proving Electronic design automation Formal methods NP-complete problems Satisfiability modulo theories Boolean satisfiability problem Maximum satisfiability problem Unit propagation
30	Decision procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools? Robert Nieuwenhuis and Albert Oliveras?? Abstract. An overview is given of a number of recent developments Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2005-10-12 08:17:46 Theoretical computer science Mathematical logic Mathematics Automated theorem proving Logic in computer science Constraint programming Boolean algebra Electronic design automation Boolean satisfiability problem Satisfiability modulo theories Unit propagation Resolution

UPDATE